An Internal Pattern Run-Length Methodology for Slice Encoding

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Run-length Encoding for Volumetric Texture

With the dramatic increase of 3D imaging techniques, there is a great demand for new approaches in texture analysis of volumetric data. In this paper, we present a new approach for volumetric texture analysis using a runlength encoding matrix and its texture descriptors. We experiment with our approach on the volumetric data generated from two normal Computed Tomography (CT) studies of the ches...

متن کامل

Pattern Run - Length for Test Data Compression

This paper presents a new pattern run-length compression method whose decompressor is simple and easy to implement. It encodes 2|n| runs of compatible or inversely compatible patterns, either inside a single test data segment or across multiple test data segments. Experimental results show that it can achieve an average compression ratio of 67.64% and considerable test application time savings.

متن کامل

An Overview of Run-length Encoding of Handwritten Word Images

Analysis of handwritten word images is closely tied to the method of representing the images. Diierent representations have their own sets of advantages and disadvantages. In this paper, we propose a novel method of encoding handwritten images using vertical runs that signiicantly simpliies the implementation of several image-processing tasks pertaining to handwriting recognition. We demonstrat...

متن کامل

Run-length Encoding on Graphics Hardware

In this report, we present a series of improvements to the basic run-length encoding algorithm. Several modified algorithms are generated, from basic CPU single-threaded compression to a highly parallelized version on NVidia CUDA hardware. We also investigated changes to memory access locality in the parallel versions. With a comparison of the various compression times and their corresponding d...

متن کامل

Compressing Optimal Paths with Run Length Encoding

We introduce a novel approach to Compressed Path Databases, space efficient oracles used to very quickly identify the first edge on a shortest path. Our algorithm achieves query running times on the 100 nanosecond scale, being significantly faster than state-of-the-art first-move oracles from the literature. Space consumption is competitive, due to a compression approach that rearranges rows an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ETRI Journal

سال: 2011

ISSN: 1225-6463

DOI: 10.4218/etrij.11.0110.0319